翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Kelley-Morse set theory ： ウィキペディア英語版 Morse–Kelley set theory In the foundation of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Quine–Morse set theory (QM) or the system of Quine and Morse is a first order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML. Morse–Kelley set theory is named after mathematicians John L. Kelley and Anthony Morse and was first set out by and later in an appendix to Kelley's text book ''General Topology'' (1955), a graduate level introduction to topology. Kelley said the system in his book was a variant of the systems due to Thoralf Skolem and Morse. Morse's own version appeared later in his book ''A Theory of Sets'' (1965). While von Neumann–Bernays–Gödel set theory is a conservative extension of Zermelo–Fraenkel set theory (ZFC, the canonical set theory) in the sense that a statement in the language of ZFC is provable in NBG if and only if it is provable in ZFC, Morse–Kelley set theory is a proper extension of ZFC. Unlike von Neumann–Bernays–Gödel set theory, where the axiom schema of Class Comprehension can be replaced with finitely many of its instances, Morse–Kelley set theory cannot be finitely axiomatized. == MK axioms and ontology == NBG and MK share a common ontology. The universe of discourse consists of classes. Classes which are members of other classes are called sets. A class which is not a set is a proper class. The primitive atomic sentences involve membership or equality. With the exception of Class Comprehension, the following axioms are the same as those for NBG, inessential details aside. The symbolic versions of the axioms employ the following notational devices: * The upper case letters other than ''M'', appearing in Extensionality, Class Comprehension, and Foundation, denote variables ranging over classes. A lower case letter denotes a variable that cannot be a proper class, because it appears to the left of an ∈. As MK is a one-sorted theory, this notational convention is only mnemonic; * The monadic predicate $\backslash \; Mx,$ whose intended reading is "'the class ''x'' is a set," abbreviates $\backslash exists\; W(x\; \backslash in\; W);$ * The empty set $\backslash varnothing$ is defined by $\backslash forall\; x\; (x\; \backslash not\; \backslash in\; \backslash varnothing);$ * The class ''V'', the universal class having all possible sets as members, is defined by $\backslash forall\; x\; (Mx\; \backslash to\; x\; \backslash in\; V).$ ''V'' is also the Von Neumann universe. Extensionality: Classes having the same members are the same class. :$\backslash forall\; X\; \backslash ,\; \backslash forall\; Y\; \backslash ,\; (\; \backslash forall\; z\; \backslash ,\; (z\; \backslash in\; X\; \backslash leftrightarrow\; z\; \backslash in\; Y)\; \backslash rightarrow\; X\; =\; Y).$ : A set and a class having the same extension are identical. Hence MK is not a two-sorted theory, appearances to the contrary notwithstanding. Foundation: Each nonempty class ''A'' is disjoint from at least one of its members. :$\backslash forall\; A\; (\backslash not\; =\; \backslash varnothing\; \backslash rightarrow\; \backslash exists\; b\; (b\; \backslash in\; A\; \backslash and\; \backslash forall\; c\; (c\; \backslash in\; b\; \backslash rightarrow\; c\; \backslash not\backslash in\; A))).$ Class Comprehension: Let φ(''x'') be any formula in the language of MK in which ''x'' is a free variable and ''Y'' is not free. φ(''x'') may contain parameters which are either sets or proper classes. More consequentially, the quantified variables in φ(''x'') may range over all classes and not just over all sets; ''this is the only way MK differs from NBG''. Then there exists a class $Y=\backslash$ whose members are exactly those sets ''x'' such that $\backslash phi(x)$ comes out true. Formally, if ''Y'' is not free in φ: :$\backslash forall\; W\_1\; ...\; W\_n\; \backslash exists\; Y\; \backslash forall\; x\; (\backslash in\; Y\; \backslash leftrightarrow\; (\backslash phi(x,\; W\_1,\; ...\; W\_n)\; \backslash and\; Mx)).$ Pairing: For any sets ''x'' and ''y'', there exists a set $z=\backslash$ whose members are exactly ''x'' and ''y''. :$\backslash forall\; x\; \backslash ,\; \backslash forall\; y\; \backslash ,\; .$ :Pairing licenses the unordered pair in terms of which the ordered pair, $\backslash langle\; x,y\; \backslash rangle$, may be defined in the usual way, as $\backslash \; \backslash \backslash \}$. With ordered pairs in hand, Class Comprehension enables defining relations and functions on sets as sets of ordered pairs, making possible the next axiom: Limitation of Size: ''C'' is a proper class if and only if ''V'' can be mapped one-to-one into ''C''. :$\backslash forall\; C\; )].$ :The formal version of this axiom resembles the axiom schema of replacement, and embodies the class function ''F''. The next section explains how Limitation of Size is stronger than the usual forms of the axiom of choice. Power set: Let ''p'' be a class whose members are all possible subsets of the set ''a''. Then ''p'' is a set. :$\backslash forall\; a\; \backslash ,\; \backslash forall\; p\; \backslash ,\; .$ Union: Let $s=\backslash bigcup\; a$ be the sum class of the set ''a'', namely the union of all members of ''a''. Then ''s'' is a set. :$\backslash forall\; a\; \backslash ,\; \backslash forall\; s\; \backslash ,\; .$ Infinity: There exists an inductive set ''y'', meaning that (i) the empty set is a member of ''y''; (ii) if ''x'' is a member of ''y'', then so is $x\; \backslash cup\; \backslash .$. :$\backslash exists\; y\; )].$ Note that ''p'' and ''s'' in Power Set and Union are universally, not existentially, quantified, as Class Comprehension suffices to establish the existence of ''p'' and ''s''. Power Set and Union only serve to establish that ''p'' and ''s'' cannot be proper classes. The above axioms are shared with other set theories as follows: * ZFC and NBG: Pairing, Power Set, Union, Infinity; * NBG (and ZFC, if quantified variables were restricted to sets): Extensionality, Foundation; * NBG: Limitation of Size; 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Morse–Kelley set theory」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.